منابع مشابه
Orthogonal Polyhedra: Representation and Computation
In this paper we investigate orthogonal polyhedra i e poly hedra which are nite unions of full dimensional hyper rectangles We de ne representation schemes for these polyhedra based on their ver tices and show that these compact representation schemes are canonical for all convex and non convex polyhedra in any dimension We then develop e cient algorithms for membership face detection and Boole...
متن کاملThe Representation of Polyhedra by Polynomial Inequalities
A beautiful result of Bröcker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every ^-dimensional polyhedron admits a representation as the set of solutions of at most d(d + l) /2 polynomial inequalities. Even in this polyhedral case, however, no constructive proof is known, even if the quadratic upper bound is replaced by any boun...
متن کاملOn the Representation of Timed Polyhedra
In this paper we investigate timed polyhedra, i.e. polyhedra which are finite unions of full dimensional simplices of a special kind. Such polyhedra form the basis of timing analysis and in particular of verification tools based on timed automata. We define a representation scheme for these polyhedra based on their extreme vertices, and show that this compact representation scheme is canonical ...
متن کاملMinimal half-spaces and external representation of tropical polyhedra
We give a characterization of the minimal tropical half-spaces containing a given tropical polyhedron, from which we derive a counter-example showing that the number of such minimal half-spaces can be infinite, contradicting some statements which appeared in the tropical literature, and disproving a conjecture of F. Block and J. Yu. We also establish an analogue of the Minkowski–Weyl theorem, s...
متن کاملA library to manipulate Z-polyhedra in image representation
The polyhedral model is a powerful mathematical framework used for program analysis (such as program transformation, automatic parallelization of nested loops, etc). It is well known that this model becomes somewhat cumbersome when we encounter modulos, “holes” in the computation domain, or non-unit-stride loops. An extension, called the Z-polyhedral model, has been proposed to manage these sit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1999
ISSN: 0179-5376
DOI: 10.1007/pl00009419